An Algorithm of Ordered Schur Factorization For Real Nonsymmetric Matrix
نویسنده
چکیده
In this paper, we present an algorithm for computing a Schur factorization of a real nonsymmetric matrix with ordered diagonal blocks such that upper left blocks contains the largest magnitude eigenvalues. Especially in case of multiple eigenvalues, when matrix is non diagonalizable, we construct an invariant subspaces with few additional tricks which are heuristic and numerical results shows the stability and accuracy of the algorithm. Keywords—Schur Factorization, Eigenvalues of nonsymmetric matrix, Orthoganal matrix.
منابع مشابه
Nonsymmetric Algebraic Riccati Equations and Wiener-Hopf Factorization for M-Matrices
We consider the nonsymmetric algebraic Riccati equation for which the four coefficient matrices form an M -matrix. Nonsymmetric algebraic Riccati equations of this type appear in applied probability and transport theory. The minimal nonnegative solution of these equations can be found by Newton’s method and basic fixed-point iterations. The study of these equations is also closely related to th...
متن کاملOn Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
The asymptotic convergence behavior of cyclic versions of the nonsymmetric Jacobi algorithm for the computation of the Schur form of a general complex matrix is investigated. Similar to the symmetric case, the nonsymmetric Jacobi algorithm proceeds by applying a sequence of rotations that annihilate a pivot element in the strict lower triangular part of the matrix until convergence to the Schur...
متن کاملA Hierarchical Low-rank Schur Complement Preconditioner for Indefinite Linear Systems
Nonsymmetric and highly indefinite linear systems can be quite difficult to solve via iterative methods. This paper combines ideas from the Multilevel Schur Low-Rank preconditioner developed by Y. Xi, R. Li, and Y. Saad [SIAM J. Matrix Anal., 37 (2016), pp. 235–259] with classic block preconditioning strategies in order to handle this case. The method to be described generates a tree structure ...
متن کاملNORTH- HOLLAND High Performance Algorithms for Toeplitz and Block Toeplitz Matrices
In this paper, we present several high performance variants of the classical Schur algorithm to factor various Toeplitz matrices. For positive definite block Toeplitz matrices, we show how hyperbolic Householder transformations may be blocked to yield a block Schur algorithm. This algorithm uses BLAS3 primitives and makes efficient use of a memory hierarchy. We present three algorithms for inde...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012